Solving Hybrid Decision-Control Problems Through Conflict-Directed Branch & Bound
نویسندگان
چکیده
ed view of the vehicle dynamics. At each tree level, the children represent avoidance of the obstacle by going (when reading left to right) South, North, East, and
منابع مشابه
Efficiently Solving Hybrid Logic/Optimization Problems Through Generalized Conflict Learning
An increasing range of problems in Artificial Intelligence and Computer Science, such as autonomous vehicle control and planning with resources, are formulated through a combination of logical, algebraic and cost constraints. Their solution requires a hybrid mixture of logical decision techniques and mathematical optimization. Using Disjunctive Programming (DP) to formulate these problems, we p...
متن کاملSolving Hybrid Decision-Control Problems Through Conflict-Directed Branch
there exists a large class of problems that incorporate both logical decision and algebraic constraints. For example, in cooperative path planning (CPP) problem, obstacle avoidance can be achieved by selecting a direction in which to avoid every obstacle, which in turn imposes an inequality constraint. Traditionally, these hybrid decision-control problems (HDCPs) are encoded in a binary integer...
متن کاملGeneralized Conflict Learning for Hybrid Discrete/Linear Optimization
Conflict-directed search algorithms have formed the core of practical, model-based reasoning systems for the last three decades. At the core of many of these applications is a series of discrete constraint optimization problems and a conflict-directed search algorithm, which uses conflicts in the forward search step to focus search away from known infeasibilities and towards the optimal feasibl...
متن کاملA Branch and Bound-PSO Hybrid Algorithm for Solving Integer Separable Concave Programming Problems
A branch and bound-PSO hybrid algorithm for solving integer separable concave programming problems is proposed, in which the lower bound of the optimal value was determined by solving linear programming relax and the upper bound of the optimal value and the best feasible solution at present were found and renewed with particle swarm optimization (PSO). It is shown by the numerical results that ...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004